Enumeration Schemes for Restricted Permutations
نویسنده
چکیده
Zeilberger’s enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WilfPlus, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
منابع مشابه
Enumeration Schemes for Permutations Avoiding Barred Patterns
We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length 6 4. We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length > 4 or a set of barred patterns.
متن کاملEnumeration Schemes for Words Avoiding Permutations
The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching method is that of enumeration schemes, introduced by Zeilberger and extended by Vatter. In this paper we further extend the method of enumeration schemes to words avoiding permutation patterns. The process of finding enumeration schemes is programmable and allows for the automatic enumer...
متن کاملRefining Enumeration Schemes to Count According to Permutation Statistics
We develop algorithmic tools to compute quickly the distribution of permutation statistics over sets of pattern-avoiding permutations. More specfically, the algorithms are based on enumeration schemes, the permutation statistics are based on the number of occurrences of certain vincular patterns, and the permutations avoid sets of vincular patterns. We prove that whenever a finite enumeration s...
متن کاملOn an open problem of Green and Losonczy: exact enumeration of freely braided permutations
Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number of freely braided permutations in Sn. In this paper, we prove that the generating function for the number of freely braided permutations in Sn is given by 1−3x−2x2 +(1+...
متن کاملRefining Enumeration Schemes to Count According to Inversion Number
Enumeration schemes were developed by Zeilberger, Vatter, and Pudwell as automatable methods to enumerate the set of permutations of length n which avoid a set of patterns B, Sn(B). In this paper we show how their schemes may be refined to enumerate Sn(B) according to the inversion number of each permutation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008